Polynomial addition sets and polynomial digraphs

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On polynomial digraphs

Let Φ(x, y) be a bivariate polynomial with complex coefficients. The zeroes of Φ(x, y) are given a combinatorial structure by considering them as arcs of a directed graph G(Φ). This paper studies some relationship between the polynomial Φ(x, y) and the structure of G(Φ).

متن کامل

Real Addition and the Polynomial Hierarchy

** The k-th alternation level of the theory of real numbers under addition and order is log-complete for the k-th level of the polynomial hierarchy. *Submitted to Information Processing Letters **Research supported in part by US Air Force Grant AFOSR 80-0196 ***

متن کامل

Polynomial-Time Membership Comparable Sets

This paper studies a notion called polynomial-time membership comparable sets. For a function g, a set A is polynomial-time g-membership comparable if there is a polynomialtime computable function f such that for any x1; ; xm with m g(maxfjx1j; ; jxmjg), outputs b 2 f0; 1gm such that (A(x1); ; A(xm)) 6= b. The following is a list of major results proven in the paper. 1. Polynomial-time membersh...

متن کامل

Convergence of Polynomial Level Sets

In this paper we give a characterization of pointwise and uniform convergence of sequences of homogeneous polynomials on a Banach space by means of the convergence of their level sets. Results are obtained both in the real and the complex cases, as well as some generalizations to the nonhomogeneous case and to holomorphic functions in the complex case. Kuratowski convergence of closed sets is u...

متن کامل

A characteristic polynomial for rooted graphs and rooted digraphs

We consider the one-variable characteristic polynomial p(G; ) in two settings. When G is a rooted digraph, we show that this polynomial essentially counts the number of sinks in G. When G is a rooted graph, we give combinatorial interpretations of several coe/cients and the degree of p(G; ). In particular, |p(G; 0)| is the number of acyclic orientations of G, while the degree of p(G; ) gives th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Linear Algebra and its Applications

سال: 1985

ISSN: 0024-3795

DOI: 10.1016/0024-3795(85)90077-1